On Finding Good State Aggregation Fun tions

Finding Basis Fun tions for Pyramidal Finite Elements

Ëùù««ööòøøøøøððøý Óó Ìýôô Blockin Blockinð Óòøøòùóù× Ùò Blockinøøóò×

Jonathan M. Borwein1, Xianfu Wang August 13, 1999 ABSTRACT. We prove a \typi al" subdi erentiability prin iple and apply it to a variety of omplete metri spa es of ontinuous fun tions on separable Bana h spa es; so as to obtain existen e of fun tions with maximal subdi erentials when ordered by in lusion. The relationship between ontinuous fun tions with maximal subdi erentials and nowhere mono...

Aeùñö¹ìììóööøø Óò×øöù Blockinøøóò× Óó Ae Blockin Blockin Blockinòø È××ùùó¹êêòòóñ Ùò Blockinøøóò×

We des ribe eÆ ient onstru tions for various ryptographi primitives in private-key as well as publi -key ryptography. Our major results are two new onstru tions of pseudorandom fun tions. We prove the pseudo-randomness of one onstru tion under the assumption that fa toring (Blum integers) is hard while the other onstru tion is pseudo-random if the de isional version of the DiÆe-Hellman assumpti...

̹¹¹ºº½½ Ëô Blockin Blockin

Relations between OWFs, PRGs and PRFs (revised) Jan-Erik Ekberg February 19, 2002 1 Introdu tion These le ture notes intend to give an overview of the provable relations between one-way fun tions (OWFs), pseudorandom generators (PRGs) and pseudorandom fun tions (PRFs). Only a sele ted number of proofs and redu tions are thoroughly presented in this paper (most are left to the referen es), but t...

On Fun tions and Types